Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings
نویسندگان
چکیده
منابع مشابه
Dominance Drawings of Bipartite Graphs
Let G = (S; T ; E) denote a directed bipartite graph with S a set of sources and T a set of sinks. Using vectors s = (s1; s2; :::sk) and t = (t1; t2; :::tk) in R k to represent the elements s 2 S and t 2 T we can geometrically characterize the properties of G. We consider the case where si ti, i = 1; 2; :::; k, (with strict inequality in at least one coordinate) if and only if the directed edge...
متن کاملRace Detection and Reachability in Nearly Series-Parallel DAGs
A program is said to have a determinacy race if logically parallel parts of a program access the same memory location and one of the accesses is a write. These races are generally bugs in the program since they lead to non-deterministic program behavior — different schedules of the program can lead to different results. Most prior work on detecting these races focuses on a subclass of programs ...
متن کاملA Greedy Approach to Answer Reachability Queries on DAGs
Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been presented adopting on-line searches, hop labelling or transitive closure compression. Transitive closure compression techniques usually construct a graph reachability index, for example by decomposing the graph into disjoi...
متن کاملWeak Dominance Drawings and Linear Extension Diameter
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P . We present complexity results and bounds.
متن کاملWeak Dominance Drawings for Directed Acyclic Graphs
The dominance drawing method has many important aesthetic properties, including small number of bends, good vertex placement, and symmetry display [1]. Furthermore, it encapsulates the aspect of characterizing the transitive closure of the digraph by means of a geometric dominance relation among the vertices. A dominance drawing Γ of a planar st-graph G is a drawing, such that for any two verti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Computer Science
سال: 2021
ISSN: 2662-995X,2661-8907
DOI: 10.1007/s42979-021-00713-6